Efficient connection strategies in 1D and 2D associative memory models with and without displaced connectivity
نویسندگان
چکیده
This study examines the performance of sparsely connected associative memory models built using a number of different connection strategies, applied to one- and two-dimensional topologies. Efficient patterns of connectivity are identified which yield high performance at relatively low wiring costs in both topologies. Networks with displaced connectivity are seen to perform particularly well. It is found that two-dimensional models are more tolerant of variations in connection strategy than their one-dimensional counterparts; though networks built with both topologies become less so as their connection density is decreased.
منابع مشابه
Optimal connection strategies in one- and two-dimensional associative memory models
This study examines the performance of sparsely-connected associative memory models built using a number of different connection strategies, applied to oneand two-dimensional topologies. Efficient patterns of connectivity are identified which yield high performance at relatively low wiring costs in both topologies. It is found that two-dimensional models are more tolerant of variations in conne...
متن کاملSparsely-connected associative memory models with displaced connectivity
Our work is concerned with finding optimum connection strategies in highperformance associative memory models. Taking inspiration from axonal branching in biological neurons, we impose a displacement of the point of efferent arborisation, so that the output from each node travels a certain distance before branching to connect to other units. This technique is applied to networks constructed wit...
متن کاملConnection Strategies in Associative Memory Models with Spiking and Non-spiking Neurons
The problem we address in this paper is that of finding effective and parsimonious patterns of connectivity in sparse associative memories. This problem must be addressed in real neuronal systems, so results in artificial systems could throw light on real systems. We show that there are efficient patterns of connectivity and that these patterns are effective in models with either spiking or non...
متن کاملConnection strategy and performance in sparsely connected 2D associative memory models with non-random images
A sparsely connected associative memory model is tested with different pattern sets, and it is found that pattern recall is highly dependent on the type of patterns used. Performance is also found to depend critically on the connection strategy used to build the networks. Comparisons of topology reveal that connectivity matrices based on Gaussian distributions perform well for all pattern types...
متن کاملUsing graph-theoretic measures to predict the performance of associative memory models
We test a selection of associative memory models built with different connection strategies, exploring the relationship between the structural properties of each network and its pattern-completion performance. It is found that the Local Efficiency of the network can be used to predict pattern completion performance for associative memory models built with a range of different connection strateg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Bio Systems
دوره 94 1-2 شماره
صفحات -
تاریخ انتشار 2008